Scheduling of 2-Steps Graph with UET Tasks in a Heterogeneous Environment
نویسندگان
چکیده
In this paper, we focus on scheduling the 2-steps graph with UET tasks, i.e. tasks with the same length, in a heterogeneous environment where processors are uniform and have different speeds. Given a 2-steps graph of size n and p processors, we determine the lower bound of the execution time of any scheduling by maximizing the activity of each processor. Then, we present an efficiency schedule in execution time and the experimental results without and with communication costs between processors and we compare the performance of our algorithm with existing scheduling scheme through the result of experiments. Keywords— 2-steps Graph, Scheduling, Communication, Heterogeneous Environment, Optimality.
منابع مشابه
Chromatic Scheduling of 1- and 2-Processor UET Tasks on Dedicated Machines with Availability Constraints
We address a generalization of the classical 1and 2-processor UET scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these constraints we show th...
متن کاملMinimizing the makespan for a UET bipartite graph on a single processor with an integer precedence delay
We consider a set of tasks of unit execution times and a bipartite precedence delays graph with a positive precedence delay d : an arc (i; j) of this graph means that j can be executed at least d time units after the completion time of i. The problem is to sequence the tasks in order to minimize the makespan. Firstly, we prove that the associated decision problem is NP-complete. Then, we provid...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملA new Shuffled Genetic-based Task Scheduling Algorithm in Heterogeneous Distributed Systems
Distributed systems such as Grid- and Cloud Computing provision web services to their users in all of the world. One of the most important concerns which service providers encounter is to handle total cost of ownership (TCO). The large part of TCO is related to power consumption due to inefficient resource management. Task scheduling module as a key component can has drastic impact on both user...
متن کامل